PAC-Reasoning in Relational Domains
نویسندگان
چکیده
We consider the problem of predicting plausible missing facts in relational data, given a set of imperfect logical rules. In particular, our aim is to provide bounds on the (expected) number of incorrect inferences that are made in this way. Since for classical inference it is in general impossible to bound this number in a non-trivial way, we consider two inference relations that weaken, but remain close in spirit to classical inference.
منابع مشابه
Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds
Inference in graphical models has emerged as a promising technique for planning. A recent approach to decision-theoretic planning in relational domains uses forward inference in dynamic Bayesian networks compiled from learned probabilistic relational rules. Inspired by work in non-relational domains with small state spaces, we derive a backpropagation method for such nets in relational domains ...
متن کاملCausal Discovery for Relational Domains: Representation, Reasoning, and Learning
CAUSAL DISCOVERY FOR RELATIONAL DOMAINS: REPRESENTATION, REASONING, AND LEARNING
متن کاملApproximate Reasoning for Efficient Anytime Induction from Relational Knowledge Bases
In most real-world applications the choice of the right representation language represents a fundamental issue, since it may give opportunities for generalization and make inductive reasoning computationally easier or harder. While the setting of First Order Logic (FOL) is the most suitable one to model the multirelational data of real and complex domains, on the other hand it puts the question...
متن کاملTowards Adversarial Reasoning in Statistical Relational Domains
Statistical relational artificial intelligence combines first-order logic and probability in order to handle the complexity and uncertainty present in many real-world domains. However, many real-world domains also include multiple agents that cooperate or compete according to their diverse goals. In order to handle such domains, an autonomous agent must also consider the actions of other agents...
متن کاملScalable Relational Learning for Sparse and Incomplete Domains
The Semantic Web (SW) presents new challenges to statistical relational learning. One of the main features of SW data is that it is notoriously incomplete. Consider friend-of-a-friend (FOAF) data. The purpose of the FOAF project is to create a web of machinereadable pages describing people, their relationships, and people’s activities and interests, using SW technology. Obviously people vary in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018